Morphological Erosions and Openings: Fast Algorithms Based on Anchors
نویسندگان
چکیده
منابع مشابه
Fast Computation of Greyscale Path Openings
Path openings are morphological operators that are used to preserve long, thin, and curved structures in images. They have the ability to adapt to local image structures, which allows them to detect lines that are not perfectly straight. They are applicable in extracting cracks, roads, and more. Although path openings are very efficient to implement for binary images, the greyscale case is more...
متن کاملFast implementation of large erosions and dilations in Mamba
Large structuring elements are used in many morphological transformations. They are needed when computing size distributions, in filtering operators (and especially in alternate sequential filters), for regularised gradients and large top-hat transforms, for residual operators (skeletons by openings, critical balls, ultimate openings and so on). Moreover, in some applications, images are large ...
متن کاملTools for Fast Morphological Analysis Based on Finite State Automata
The paper presents a new implementation of some of Jan Daciuk’s algorithms and tools for morphological analysis based on finite state automata [1]. In particular, we offer a reimplemented version of the tool which builds the automata from an input set of strings and of the tool which performs the morphological analysis itself. In addition to 8bit versions we also offer “Unicode-aware” versions ...
متن کاملFast and Efficient Evolutionary Algorithms Based on Bayesian Networks
Abstract—Evolutionary algorithms are powerful search techniques which have been used successfully in many different domains. Parallel evolutionary algorithm has become a research focus due to its easy implement and promise substantial gains in performance. In this paper a framework of tree-modelbased parallel evolutionary algorithm (T-PEA) is proposed. The presented method employs Bayesian Diri...
متن کاملA Comparison of Algorithms for Connected Set Openings and Closings
ÐThe implementation of morphological connected set operators for image filtering and pattern recognition is discussed. Two earlier algorithms based on priority queues and hierarchical queues, respectively, are compared to a more recent union-find approach. Unlike the earlier algorithms which process regional extrema in the image sequentially, the union-find method allows simultaneous processing...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Imaging and Vision
سال: 2005
ISSN: 0924-9907,1573-7683
DOI: 10.1007/s10851-005-4886-2